Methods for Appearance-based Loop Closure Detection by Emilio Garcia-Fidalgo & Alberto Ortiz
Author:Emilio Garcia-Fidalgo & Alberto Ortiz
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham
(4.1)
(4.2)
Informally, a high precision value means a low number of false positives, while a high recall value means a low number of false negatives. A graphical representation of the precision and recall metrics is shown in Fig. 4.1.
In order to use the precision-recall metrics to evaluate the performance of the algorithms presented in this book, the datasets introduced in Sect. 4.2 are provided with a ground truth, which indicates, for each image in the sequence, which other images can be considered to close a loop with it. Then, the assessment is performed counting for each dataset the number of true positives, true negatives, false positives and false negatives, where positive is meant for detection of loop closure. The precision P is then defined as the ratio of real loop closure detections to total amount of loop closures detected, while the recall R is defined as the ratio of real loop closures to total amount of loop closures existent in the dataset.
For loop closure detection, it is essential to avoid false positives, since it means that two images have been identified as a loop but, in reality, they represent different places. This will induce the algorithm to produce inconsistent maps and, therefore, avoiding these false positives becomes essential. By definition, if no false positives are found, the precision reaches 100% (see Eq. 4.1). Then, in our experiments, we are interested in finding the best recall than can be achieved at 100% of precision using each approach, which indicates the percentage of loop closures that can be detected by the algorithm without false positive detections.
Fig. 4.1Precision and recall metrics. The items that are positive according to the ground truth are located to the left of the straight line, while the items retrieved as positive by the binary classifier are inside the oval area. The red areas represent errors. Then, the red area located to the left of the line and outside of the oval area represents the positive items that could not be retrieved (false negatives), while the red area inside the oval area represents the items retrieved as positives that are not actually positives (false positives)
Download
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.
The Mikado Method by Ola Ellnestam Daniel Brolund(25281)
Hello! Python by Anthony Briggs(24333)
Secrets of the JavaScript Ninja by John Resig Bear Bibeault(23419)
Kotlin in Action by Dmitry Jemerov(22503)
The Well-Grounded Java Developer by Benjamin J. Evans Martijn Verburg(21956)
Dependency Injection in .NET by Mark Seemann(21837)
OCA Java SE 8 Programmer I Certification Guide by Mala Gupta(20704)
Algorithms of the Intelligent Web by Haralambos Marmanis;Dmitry Babenko(19517)
Grails in Action by Glen Smith Peter Ledbrook(18594)
Adobe Camera Raw For Digital Photographers Only by Rob Sheppard(17028)
Sass and Compass in Action by Wynn Netherland Nathan Weizenbaum Chris Eppstein Brandon Mathis(15836)
Secrets of the JavaScript Ninja by John Resig & Bear Bibeault(13683)
Test-Driven iOS Development with Swift 4 by Dominik Hauser(11850)
Jquery UI in Action : Master the concepts Of Jquery UI: A Step By Step Approach by ANMOL GOYAL(11151)
A Developer's Guide to Building Resilient Cloud Applications with Azure by Hamida Rebai Trabelsi(10621)
Hit Refresh by Satya Nadella(9185)
The Kubernetes Operator Framework Book by Michael Dame(8561)
Exploring Deepfakes by Bryan Lyon and Matt Tora(8400)
Robo-Advisor with Python by Aki Ranin(8357)